Hidden Gold in Random Generation of SAT Satisfiable Instances
نویسندگان
چکیده
Evaluation of incomplete algorithms that solve SAT requires to generate hard satisfiable instances. For that purpose, the kSAT uniform random generation is not usable. The other generators of satisfiable instances generate instances that are not intrinsically hard, or exhaustive tests have not been done for determining hard and easy areas. A simple method for generating random hard satisfiable instances is presented. Instances are empirically shown to be hard for three classical methods: the "Davis-Putnam" procedure (which is complete), and the two incomplete methods: GSAT and the Break Out Method. Moreover, a new method for escaping from local minima is presented.
منابع مشابه
An Improved Satisfiable SAT Generator Based on Random Subgraph Isomorphism
We introduce Satisfiable Random High Degree Subgraph Isomorphism Generator(SRHD-SGI), a variation of the Satisfiable Random Subgraph Isomorphism Generator (SR-SGI). We use the direct encoding to translate the SRHD-SGI instances into Satisfiable SAT instances. We present empirical evidence that the new model preserves the main characteristics of SAT encoded SR-SGI: easy-hard-easy pattern of evol...
متن کاملExperimental Results on the Satisfiable Core in Random 3SAT
Given a satisfiable k-CNF SAT instance, a satisfiable core is a minimal subset of the k-CNF clauses that preserves all and only the satisfying assignments of the original instance. In this paper, we extend the previous results on satisfiable core, especially on the strong correlation between the hardness of SAT instances and the size of their satisfiable cores. We introduce a measure called the...
متن کاملN ov 2 00 3 Many Hard Examples in Exact Phase Transitions with Application to Generating Hard Satisfiable Instances
This paper analyzes the resolution complexity of two random CSP models (i.e. Model RB/RD) for which we can establish the existence of phase transitions and identify the threshold points exactly. By encoding CSPs into CNF formulas, this paper proves that almost all instances of Model RB/RD have no tree-like resolution proofs of less than exponential size. Thus, we not only introduce new families...
متن کاملFurther Investigations into Regular XORSAT
Recent years have witnessed rapid progress both in the foundations of and in applying state-of-art solvers for the propositional satisfiability problem (SAT). The study of sources for hard SAT instances is motivated by the need for interesting benchmarks for solver development and on the other hand by theoretical analysis of different proof systems. In this respect satisfiable instance families...
متن کامل1 N ov 2 00 3 Many Hard Examples in Exact Phase Transitions with Application to Generating Hard Satisfiable Instances
Abstract. This paper first analyzes the resolution complexity of two random CSP models (i.e. Model RB/RD) for which we can establish the existence of phase transitions and identify the threshold points exactly. By encoding CSPs into CNF formulas, it is proved that almost all instances of Model RB/RD have no tree-like resolution proofs of less than exponential size. Thus, we not only introduce n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997